Probabilistic Termination Versus Fair Termination
نویسنده
چکیده
In this paper we show that probabilistic termination of concurrent program is in many cases much simpler than the "f~" one. For a wide class of definitions of probabilistic termination we may express termination by rrf arithmetic formula, whereas the "fair" termination can be expressed only by rrf secqnd order arithmetic formula. Proof of "fair" termination usually needs induction on recursive ordinals. but proof of probabilistic termination has the complexity equivalent to that of detepninistic pro$ram termination.
منابع مشابه
Modularity of Termination of TRS under Fair Strategies
We define a new notion of fairness for term rewriting system (TRS). We prove the modularity of termination of TRS under such fair strategies, that is, two TRS terminate under fair strategies if and only if their disjoint union terminates under fair strategies. In order to do so, we demonstrate that termination under fair strategies of a TRS is equivalent to the TRS being weakly terminating and ...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملTermination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving automatically the termination of concurrent systems under fairness assumptions. We adopt the thesis that a concurrent system can be naturally modeled as a rewrite system, and develop a theoretical approach to systematically transform, ...
متن کاملTermination of Fair Computations in Term Rewriting
The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving automatically the termination of concurrent systems under fairness assumptions. We adopt the thesis that a concurrent system can be naturally modeled as a rewrite system, and develop a reductionistic theoretical approach to systematica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 66 شماره
صفحات -
تاریخ انتشار 1989